翻訳と辞書 Words near each other ・ Module of covariants ・ Module pattern ・ Module spectrum ・ Modulf Aukan ・ Moduli (physics) ・ Moduli of algebraic curves ・ Moduli scheme ・ Moduli space ・ Moduli stack of formal group laws ・ Moduli stack of principal bundles ・ Modulidae ・ Modulin ・ Modulo ・ Modulo (jargon) ・ Modulo operation ・ Modulo-N code ・ Modulok (rapper) ・ Modulon ・ Modulor ・ Modulus ・ Modulus (algebraic number theory) ・ Modulus (gastropod) ・ Modulus ambiguus ・ Modulus and characteristic of convexity ・ Modulus bayeri ・ Modulus calusa ・ Modulus carchedonius ・ Modulus guernei ・ Modulus Guitars ・ Modulus modulus Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Modulo-N code ： ウィキペディア英語版 Modulo-N code Modulo-N code is a lossy compression algorithm used to compress correlated data sources using modulo arithmetic. ==Compression== When applied to two nodes in a network whose data are in close range of each other Modulo-N code requires one node (say odd) to send the coded data value as the raw data $M\_o\; =\; D\_o$; the even node is required to send the coded data as the $M\_e\; =\; (D\_e)\; mod\; (N)$. Hence the name Modulo-N code. Since it is known that for a number K, at least $log\_2(K)$ bits are required to represent it in binary. So the modulo coded data of the two nodes requires totally $log\_2(M\_o)\; +\; log\_2(M\_e)$. As we can generally expect $log\_2(M\_e)\; \backslash le\; log\_2(M\_o)$ always, because $M\_e\; \backslash le\; N$. This is the how compression is achieved. A compression ratio achieved is $C.R\; =\; \backslash frac$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Modulo-N code」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.